Surface remeshing by local hermite diffuse interpolation

Constrained Interpolation via Cubic Hermite Splines

Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation.  It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...

Hermite Interpolation Outperforms Nyström Interpolation

Hermite interpolation is shown to be much more stable than Nyström interpolation in the context of solving classic Fredholm second kind integral equations of potential theory in two dimensions using panel-based Nyström discretization. AMS subject classification (2000): 31A10,45B05,65D05,65R20.

Hermite Interpolation Using ERBS with Trigonometric Polynomial Local Functions

Geometric Hermite interpolation by logarithmic arc splines

This paper considers the problem of G1 curve interpolation using a special type of discrete logarithmic spirals. A ”logarithmic arc spline” is defined as a set of smoothly connected circular arcs. The arcs of a logarithmic arc spline have equal angles and the curvatures of the arcs form a geometric sequence. Given two points together with two unit tangents at the points, interpolation of logari...

Geometric Hermite interpolation by cubic G1 splines

In this paper, geometric Hermite interpolation by planar cubic G1 splines is studied. Three data points and three tangent directions are interpolated per each polynomial segment. Sufficient conditions for the existence of such G1 spline are determined that cover most of the cases encountered in practical applications. The existence requirements are based only upon geometric properties of data a...